Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
نویسندگان
چکیده
منابع مشابه
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
Although the CSP (constraint satisfaction problem) is NP-complete, even in the case when all constraints are binary, certain classes of instances are tractable. We study classes of binary CSP instances defined by excluding subproblems. This approach has recently led to the discovery of novel tractable classes. The complete characterisation of all tractable classes defined by forbidding patterns...
متن کاملConstraint Satisfaction, Logic and Forbidden Patterns
In the early nineties, Feder and Vardi attempted to find a large sub-class of NP which exhibits a dichotomy; that is, where every problem in the sub-class is either solvable in polynomial-time or NP-complete. Their studies resulted in a candidate class of problems, namely those definable in the logic MMSNP. Whilst it remains open as to whether MMSNP exhibits a dichotomy, for various reasons it ...
متن کاملThe complexity of recursive constraint satisfaction problems
We investigate the complexity of finding solutions to infinite recursive constraint satisfaction problems. We show that, in general, the problem of finding a solution to an infinite recursive constraint satisfaction problem is equivalent to the problem of finding an infinite path through a recursive tree. We also identify natural classes of infinite recursive constraint problems where the probl...
متن کاملThe Optimization Complexity of Constraint Satisfaction Problems
In 1978, Schaefer [12] considered a subclass of languages in NP and proved a “dichotomy theorem” for this class. The subclass considered were problems expressible as “constraint satisfaction problems”, and the “dichotomy theorem” showed that every language in this class is either in P, or is NP-hard. This result is in sharp contrast to a result of Ladner [9], which shows that such a dichotomy d...
متن کاملThe Complexity of Constraint Satisfaction Problems∗
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.10.035